Maximum Entropy Low-Rank Matrix Recovery
نویسندگان
چکیده
منابع مشابه
Maximum entropy low-rank matrix recovery
We propose a novel, information-theoretic method, called MaxEnt, for efficient data requisition for low-rank matrix recovery. This proposed method has important applications to a wide range of problems in image processing, text document indexing and system identification, and is particularly effective when the desired matrix X is high-dimensional, and measurements from X are expensive to obtain...
متن کاملLow rank matrix recovery from Clifford orbits
We prove that low-rank matrices can be recovered efficiently from a small number of measurements that are sampled from orbits of a certain matrix group. As a special case, our theory makes statements about the phase retrieval problem. Here, the task is to recover a vector given only the amplitudes of its inner product with a small number of vectors from an orbit. Variants of the group in questi...
متن کاملs-Goodness for Low-Rank Matrix Recovery
and Applied Analysis 3 If there does not exist such y for some X as above, we set γ s (A, β) = +∞ and to be compatible with the special case given by [24] we write γ s (A), γ s (A) instead of γ s (A, +∞), γ s (A, +∞), respectively. From the above definition, we easily see that the set of values that γ takes is closed. Thus, when γ s (A, β) < +∞, for every matrix X ∈ Rm×n with s nonzero singular...
متن کاملQuantization for Low-Rank Matrix Recovery
We study Sigma-Delta quantization methods coupled with appropriate reconstruction algorithms for digitizing randomly sampled low-rank matrices. We show that the reconstruction error associated with our methods decays polynomially with the oversampling factor, and we leverage our results to obtain root-exponential accuracy by optimizing over the choice of quantization scheme. Additionally, we sh...
متن کاملUniqueness Conditions For Low-Rank Matrix Recovery
Low-rank matrix recovery addresses the problem of recovering an unknown low-rank matrix from few linear measurements. Nuclear-norm minimization is a tractable approach with a recent surge of strong theoretical backing. Analagous to the theory of compressed sensing, these results have required random measurements. For example, m ≥ Cnr Gaussian measurements are sufficient to recover any rank-r n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2018
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2018.2840481